A New Method to Obtain Pythagorean Triple Preserving Matrices
نویسندگان
چکیده
منابع مشابه
A new method to obtain lower bounds for polynomial evaluation
We present a new method to obtain lower bounds for the time complexity of polynomial evaluation procedures. Time, denoted by L, is measured in terms of nonscalar arithmetic operations. In contrast with known methods for proving lower complexity bounds, our method is purely combinatorial and does not require powerful tools from algebraic or diophantine geometry. By means of our method we are abl...
متن کاملLinear maps preserving or strongly preserving majorization on matrices
For $A,Bin M_{nm},$ we say that $A$ is left matrix majorized (resp. left matrix submajorized) by $B$ and write $Aprec_{ell}B$ (resp. $Aprec_{ell s}B$), if $A=RB$ for some $ntimes n$ row stochastic (resp. row substochastic) matrix $R.$ Moreover, we define the relation $sim_{ell s} $ on $M_{nm}$ as follows: $Asim_{ell s} B$ if $Aprec_{ell s} Bprec_{ell s} A.$ This paper characterizes all linear p...
متن کاملUsage of Pythagorean Triple Sequence in OSPF
Shutting down a link for the purposes of a scheduled routine maintenance does cause the forwarding path to change. If these changes are not done in a required order will cause not only transient micro loops but also an overload in some links. Currently, some ISP operators use a graceful link shutdown procedure by first setting up the Interior Gateway Protocol (IGP) link metric to MAX_METRIC − 1...
متن کاملNote on the Pythagorean Triple System
We investigate some combinatorial aspects of the “Pythagorean triple system”. Our motivation is the following question: Is it possible to color the naturals with finitely many colors so that no Pythagorean triple is monochromatic? This question is open even for two colors. A natural approach is to search for a nonbipartite triple system that can be realized as a family of Pythagorean triples. S...
متن کاملlinear maps preserving or strongly preserving majorization on matrices
for $a,bin m_{nm},$ we say that $a$ is left matrix majorized (resp. left matrix submajorized) by $b$ and write $aprec_{ell}b$ (resp. $aprec_{ell s}b$), if $a=rb$ for some $ntimes n$ row stochastic (resp. row substochastic) matrix $r.$ moreover, we define the relation $sim_{ell s} $ on $m_{nm}$ as follows: $asim_{ell s} b$ if $aprec_{ell s} bprec_{ell s} a.$ this paper characterizes all linear p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Missouri Journal of Mathematical Sciences
سال: 2002
ISSN: 0899-6180
DOI: 10.35834/2002/1403149